A Constraint Solver Synthesiser: Case for Support
نویسندگان
چکیده
This document is the case for support for Grant number EP/H004092/1, funded by the EPSRC in the UK. Our aim is to improve dramatically the scalability of constraint technology, while removing its reliance on manual tuning by an expert. This aim will be realised through the development of a constraint solver synthesiser, the principal components of which are a Model Analyser, a Constraint Solver Generator, and a Generator Tuner. As a research proposal, the reader should bear in mind that this is a proposal for future work, rather than a report on completed research.
منابع مشابه
Simulation of Strap-On Boosters Separation in the Atmosphere
A numerical dynamic-aerodynamic interface for simulating the separation dynamics of constrained strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint Force Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dynamic mesh updating procedure is employed using smoothing and l...
متن کاملEvaluation of String Constraint Solvers Using Dynamic Symbolic Execution
Symbolic execution is a path sensitive program analysis technique used for error detection and test case generation. Symbolic execution tools rely on constraint solvers to determine the feasibility of program paths and generate concrete inputs for feasible paths. Therefore, the effectiveness of such tools depends on their constraint solvers. Most modern constraint solvers for primitive data typ...
متن کاملProgram Synthesis for Combinatorial Optimisation Problems Position Statement
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable empirical determination — by a synthesiser — of how to ‘best’ represent the decision variables of a combinatorial optimisation problem, based on (real-life) training instances of the problem. In the extreme case where no such training instances are provided, such a synthesiser would simply be non...
متن کاملProgram Synthesis for Combinatorial Optimization Problems
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable mpirical determination -by a synthesiser -of how to ’best’ represent the decision variables of a combinatorial optimisation problem, based on (real-life) training instances of the problem. the extreme case where no such training instances are provided, such a synthesiser would simply be non-deter...
متن کاملA Simple Constraint Solver in Action Rules for the CP’05 Solver Competition
In response to the call for solvers by the CPAI’05 solver competition organizing committee, we implemented a constraint solver, called Mosar, using action rules (AR) in B-Prolog [3] particularly for this competition. The problem format used in the competition is very different from those used by practical solvers. For example, constraints are extensional numeric relations not implicit relations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009